منابع مشابه
Evaluating Backup Algorithms
We present a trace-driven simulator that evaluates the performance of backup algorithms. We use this simulator to compare the performance of the commonly-used level scheme (our name for the algorithm used by the UNIX dump utility) with that of a new algorithm called the Z scheme. We show that the Z scheme has better backup performance than the level scheme and slightly worse restore performance...
متن کاملEfficient recursive backup parsing
There are several ways to create an exact recognizer for the language defined by a context free grammar. The recursive backup technique, proposed by [Kos75], is capable of handling (locally) ambiguous grammars. Due to its structure, it is not limited to context free grammars, but applicable for affix grammars in general. This paper shows that ‘tactful’ recursive backup parsing can be efficient,...
متن کاملA Revocable Backup System
We present a system which enables a user to remove a le from both the le system and all the backup tapes on which the le is stored. The ability to remove les from all backup tapes is desirable in many cases. Our system erases information from the backup tape without actually writing on the tape. This is achieved by applying cryptography in a new way: a block cipher is used to enable the system ...
متن کاملOptimal Primary-Backup Protocols
One way to implement a fault-tolerant service is to employ multiple sites that fail independently. The state of the service is replicated and distributed among these sites, and updates are coordinated so that even when a subset of the sites fail, the service remains available. A common approach to structuring such replicated services is to designate one site as the primary and all the others as...
متن کاملA DHT-based Backup System
Distributed hash tables have been proposed as a way to simplify the construction of large-scale distributed applications (e.g. [1, 6]). DHTs are completely decentralized systems that provide block storage on a changing collection of nodes spread throughout the Internet. Each block is identified by a unique key. DHTs spread the load of storing and serving blocks across all of the active nodes an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nursing Standard
سال: 2008
ISSN: 0029-6570,2047-9018
DOI: 10.7748/ns2008.05.22.38.62.p4171